Pseudo 1-homogeneous distance-regular graphs
نویسندگان
چکیده
Let be a distance-regular graph of diameter d ≥ 2 and a1 = 0. Let θ be a real number. A pseudo cosine sequence for θ is a sequence of real numbers σ0, . . . , σd such that σ0 = 1 and ciσi−1 + aiσi + biσi+1 = θσi for all i ∈ {0, . . . , d−1}. Furthermore, a pseudo primitive idempotent for θ is Eθ = s ∑di=0 σiAi , where s is any nonzero scalar. Let v̂ be the characteristic vector of a vertex v ∈ V . For an edge xy of and the characteristic vector w of the set of common neighbours of x and y, we say that the edge xy is tight with respect to θ whenever θ = k and a nontrivial linear combination of vectors Ex̂, Eŷ and Ew is contained in Span{ẑ | z ∈ V , ∂(z, x) = d = ∂(z, y)}. When an edge of is tight with respect to two distinct real numbers, a parameterization with d + 1 parameters of the members of the intersection array of is given (using the pseudo cosines σ1, . . . , σd , and an auxiliary parameter ε). Let S be the set of all the vertices of that are not at distance d from both vertices x and y that are adjacent. The graph is pseudo 1-homogeneous with respect to xy whenever the distance partition of S corresponding to the distances from x and y is equitable in the subgraph induced on S. We show is pseudo 1-homogeneous with respect to the edge xy if and only if the edge xy is tight with respect to two distinct real numbers. Finally, let us fix a vertex x of . Then the graph is pseudo 1-homogeneous with respect to any edge xy, and the local graph of x is connected if and only if there is the above parameterization with d + 1 parameters σ1, . . . , σd, ε and the local graph of x is strongly regular with nontrivial eigenvalues a1σ/(1 + σ) and (σ2 − 1)/(σ − σ2). A. Jurišić ( ) Faculty of Computer and Informatic Sciences, University of Ljubljana, Ljubljana, Slovenia e-mail: [email protected] P. Terwilliger Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706-1388, USA 510 J Algebr Comb (2008) 28: 509–529
منابع مشابه
Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs
Let Γ denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3 and intersection numbers ci , bi (0 ≤ i ≤ D). By a pseudo cosine sequence of Γ we mean a sequence of scalars σ0, . . . , σD such that σ0 = 1 and ciσi−1 + biσi+1 = kσ1σi for 1 ≤ i ≤ D − 1. By an associated pseudo primitive idempotent we mean a nonzero scalar multiple of the matrix ∑D i=0 σi Ai , where A0, . . . , ...
متن کاملLocally Pseudo-Distance-Regular Graphs
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph 1 when it is seen from a given vertex. The price to be paid for speaking about a kind of distance-regularity in the non-regular case seems to be locality....
متن کاملTriangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
We classify triangleand pentagon-free distance-regular graphs with diameter d ≥ 2, valency k, and an eigenvalue multiplicity k. In particular, we prove that such a graph is isomorphic to a cycle, a k-cube, a complete bipartite graph minus a matching, a Hadamard graph, a distance-regular graph with intersection array {k, k − 1, k − c, c, 1; 1, c, k − c, k − 1, k}, where k = γ(γ + 3γ + 1), c = γ(...
متن کاملFrom Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs
The local adjacency polynomials can be thought of as a generalization, for all graphs, of (the sums of ) the distance polynomials of distance-regular graphs. The term ``local'' here means that we ``see'' the graph from a given vertex, and it is the price we must pay for speaking of a kind of distance-regularity when the graph is not regular. It is shown that when the value at * (the maximum eig...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008